Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ENVELOPPE CONVEXE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 923

  • Page / 37
Export

Selection :

  • and

A NOTE ON LEE AND SCHACHTER'S ALGORITHM FOR DELAUNAY TRIANGULATIONSHAPIRO M.1981; INT. J. COMPUTER INF. SCI.; ISSN 0091-7036; USA; DA. 1981; VOL. 10; NO 6; PP. 413-418; BIBL. 3 REF.Article

CONSTRUCTING THE CONVEX HULL OF A SET OF POINTS IN THE PLANEGREEN PJ; SILVERMAN BW.1979; COMPUTER J.; GBR; DA. 1979; VOL. 22; NO 3; PP. 262-266; BIBL. 6 REF.Article

THE CONVEX HULL OF A SPHERICALLY SYMMETRIC SAMPLEEDDY WF; GALE JD.1981; ADV. APPL. PROBAB.; ISSN 0001-8678; GBR; DA. 1981; VOL. 13; NO 4; PP. 751-763; BIBL. 30 REF.Article

TWO REMARKS ON A CONVEX HULL ALGORITHMAKL SG.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 2; PP. 108-109; BIBL. 1 REF.Article

ANOTHER EFFICIENT ALGORITHM FOR CONVEX HULLS IN TWO DIMENSIONSANDREW AM.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 5; PP. 216-219; BIBL. 12 REF.Article

AN OPTIMAL REAL-TIME ALGORITHM FOR PLANAR CONVEX HULLSPREPARATA FP.1979; COMMUNIC. A.C.M.; USA; DA. 1979; VOL. 22; NO 7; PP. 402-405; BIBL. 7 REF.Article

CONVEX HULL OF A FINITE SET OF POINTS IN TWO DIMENSIONSBYKAT A.1978; INFORM. PROCESSG LETTERS; NLD; DA. 1978; VOL. 7; NO 6; PP. 296-298; BIBL. 6 REF.Article

ANALYSIS OF "DOT PRODUCT SPACE" SHAPE DESCRIPTIONSSLOAN KR JR.1982; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 1; PP. 87-90; BIBL. 8 REF.Article

CONVEX RULLS AND EXTREME POINTS OF SOME CLASSES OF MULTIVALENT FUNCTIONSKAPOOR GP; MISHRA AK.1982; J. MATH. ANAL. APPL.; ISSN 0022-247X; USA; DA. 1982; VOL. 87; NO 1; PP. 116-126; BIBL. 14 REF.Article

A LOWER BOUND TO FINDING CONVEX HULLSCHI CHIH YAO A.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 4; PP. 780-787; BIBL. 5 REF.Article

VORONOI DIAGRAMS FROM CONVEX HULLSBROWN KQ.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 5; PP. 223-228; BIBL. 25 REF.Article

A CONSTANT-TIME PARELLEL ALGORITHM FOR COMPUTING CONVEX HULLSAKL SG.1982; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1982; VOL. 22; NO 2; PP. 130-134; BIBL. 14 REF.Article

EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONSAKL SG; TOUSSAINT GT.sdINTERNATIONAL JOINT CONFERENCE ON PATTERN RECOGNITION. 4/1978/KYOTO; JPN; DA. S.D.; PP. 483-487; BIBL. 39 REF.Conference Paper

A NOTE ON LINEAR EXPECTED TIME ALGORITHMS FOR FINDING CONVEX HULLSDEVROYE L; TOUSSAINT GT.1981; COMPUTING; ISSN 0010-485X; AUT; DA. 1981; VOL. 26; NO 4; PP. 361-366; ABS. GER; BIBL. 14 REF.Article

ON THE OMEGA (N LOG N) LOWER BOUND FOR CONVEX HULL AND MAXIMAL VECTOR DETERMINATIONVAN EMDE BOAS P.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 3; PP. 132-136; BIBL. 14 REF.Article

APPROXIMATION ALGORITHMS FOR CONVEX HULLSBENTLEY JL; FAUST MG; PREPARAT FP et al.1982; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1982; VOL. 25; NO 1; PP. 64-68; BIBL. 10 REF.Article

RECOGNITION OF HANDPRINTED CHARACTERS BY AN OUTERMOST POINT METHODYAMAMOTO K; MORI S.1980; PATTERN RECOGNIT.; GBR; DA. 1980; VOL. 12; NO 4; PP. 229-236; BIBL. 15 REF.Article

The complexity of incremental convex hull algorithms in RdKALLAY, M.Information processing letters. 1984, Vol 19, Num 4, issn 0020-0190, 197Article

L'Enveloppe convexe du mouvement brownien = The convex bull of Brownian motionEL BACHIR, Mohammed.1983, 75 pThesis

Testing membership in matroid polyhedraCUNNINGHAM, W. H.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 2, pp 161-188, issn 0095-8956Article

COMMENTS ON "A COUNTEREXAMPLE TO A DIAMETER ALGORITHM FOR CONVEX POLYGONS"SNYDER WE; TANG DA.1982; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 3; PP. 309; BIBL. 1 REF.Article

ON PERMUTATIONS, CONVEX HULLS, AND NORMAL OPERATORSSUNDER VS.1982; LINEAR ALGEBRA & APPL.; ISSN 0024-3795; USA; DA. 1982; VOL. 48; PP. 403-411; BIBL. 13 REF.Article

DETERMINATION OF THE CONVEX HULL OF A FINITE SET OF PLANAR POINTS WITHIN LINEAR TIMEHUEBLER A; KLETTE R; VOSS K et al.1981; ELEKTRON. INFORMATIONSVERARB. KYBERN.; ISSN 0013-5712; DDR; DA. 1981; VOL. 17; NO 2-3; PP. 121-139; ABS. GER/RUS; BIBL. 24 REF.Article

FURTHER COMMENTS ON BYKAT'S CONVEX HULL ALGORITHMOVERMARS MH; VAN LEEUWEN J.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 10; NO 4-5; PP. 209-212; BIBL. 8 REF.Article

A COUNTEREXAMPLE TO A DIAMETER ALGORITHM FOR CONVEX POLYGONSBHATTACHARYA BK; TOUSSAINT GT.1982; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 3; PP. 306-309; BIBL. 8 REF.Article

  • Page / 37